Adaptive Assertion - Level Proofs ( Extended Abstract ) ∗

نویسندگان

  • Christoph Benzmüller
  • Marvin Schiller
چکیده

For nearly two decades human-oriented theorem proving techniques have been in the focus of interest of the ΩMEGA project [1] at Saarland University. And since one decade their application to tutorial natural language dialog on mathematical proofs has been studied in the interdisciplinary project DIALOG [3]. The focus on user-orientedness and mathematical practice in these projects resulted in developments such as assertion level proofs, achievements in the field of tactic proof search and proof planning, and investigations into qualitative aspects of the generated proofs. The notion of the assertion level proofs was originally devised by Huang (cf. [1]). It characterizes proofs where each inference step is justified by a mathematical fact, such as a definition, theorem or a lemma. Initially, assertion level proofs were generated in a post-processing step from natural deduction proofs. The new ΩMEGA-CoRe system [1] supports reasoning directly at the assertion level. The ΩMEGA project (among others) has pioneered hierarchical proofs via tactics and proof planning as a human-oriented way of organizing proof search. The notion of island proofs was introduced for proof sketches deliberately omitting proof parts. Users are enabled to formulate proofs by indicating only a subset of relevant intermediary formulas, and automated proof search is used to fill the logical gaps in the argumentation. Traditionally, proof scripts and tactics specify a sequence of actions to be carried out in order to obtain a proof. In contrast to that, the advantage of island proofs (or declarative proof plans/sketches) is that they as such constitute a meaningful and human-readable proof representation, by making the intermediate stages of the proof explicit. This prompted the development of declarative proof scripts (cf. [2]) to enable tactic reasoning at a user-friendly level of representation. Hierarchical proofs, such as generated by tactics, enable proofs at different levels of abstraction. However, in a user-oriented setting such as e-learning for mathematical proofs, we need to ensure that the step size (granularity) of proofs is appropriate in the given context. To address this issue we have proposed and investigated metrics for appropriate proof step size, which we align with empirical standards as determined by experiments [5, 6]. Initially, we devise a catalog of criteria of (singleor multi-inference) proof steps that we deem potentially relevant for judging their granularity in context. This process of identifying relevant criteria is supported by a corpus of students’ proof steps, collected in the DIALOG project, which are annotated with granularity judgments by human expert judges. The question thus is, what distinguishes steps that were judged as appropriate from those considered inappropriate? We investigate a list of criteria:

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Assertion level proof planning with compiled strategies

The objective of this thesis is to ease the formalization of proofs by being able to verify as well as to automatically construct abstract human-style proofs. This is achieved by lifting the logical basis to the abstract assertion level, which has been identified as a style of reasoning that can be found in textbooks. A case study shows that automatic reasoning procedures benefit from the abstr...

متن کامل

The Presentation of Proofs at theAssertion Level

Most automated theorem provers suuer from the problem that they can produce proofs only in formalisms diicult to understand even for experienced mathematicians. EEorts have been made to transform such machine generated proofs into natural deduction (ND) proofs. Although the single steps are now easy to understand, the entire proof is usually at a low level of abstraction, containing too many te...

متن کامل

PROVERB { A System Explaining Machine - Found ProofsXiaorong

This paper outlines an implemented system called PROVERB that explains machine-found natural deduction proofs in natural language. Diierent from earlier works, we pursue a reconstructive approach. Based on the observation that natural deduction proofs are at a too low level of abstraction compared with proofs found in mathematical textbooks, we deene rst the concept of so-called assertion level...

متن کامل

Reconstruction Proofs at the Assertion Level

Most automated theorem provers suuer from the problem that they can produce proofs only in formalisms diicult to understand even for experienced mathematicians. EEort has been made to reconstruct natural deduction (ND) proofs from such machine generated proofs. Although the single steps in ND proofs are easy to understand, the entire proof is usually at a low level of abstraction, containing to...

متن کامل

Data Dependencies on Inequalities

A6stract: Numerical inequalities present new challenges to data-base systems that keep track of “dependencies,” or reasons for beliefs. Care must be taken in interpreting an inequality as an assertion, since occasionally a %trongn interpretation is needed, that the inequality is best known bound on a quantity. Such inequalities often have many proofs, so that the proper response to their erasur...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010